Mining frequent biological sequences based on bitmap without candidate sequence generation
نویسندگان
چکیده
منابع مشابه
Mining frequent biological sequences based on bitmap without candidate sequence generation
Biological sequences carry a lot of important genetic information of organisms. Furthermore, there is an inheritance law related to protein function and structure which is useful for applications such as disease prediction. Frequent sequence mining is a core technique for association rule discovery, but existing algorithms suffer from low efficiency or poor error rate because biological sequenc...
متن کاملMining Frequent Itemsets without Candidate Generation using Optical Neural Network
We propose an efficient technique for mining frequent itemsets in large databases making use of Optical Neural Network Model. It eliminates the need to generate candidate sets and joining them for finding frequent itemsets for association rule mining. Since optical neural network performs many computations simultaneously, the time complexity is very low as compared to other data mining techniqu...
متن کاملMining Frequent Closed Itemsets without Duplicates Generation
Closed itemsets are semantically equivalent to frequent itemsets but are orders of magnitude fewer, thus allowing the knowledge extracted from a transactional database to be represented very concisely. Unfortunately, no algorithm has been yet devised which allows to mine closed patterns directly. All existing algorithms may in fact generate the same closed itemset multiple times, and need to ma...
متن کاملTree Growth Based Episode Mining without Candidate Generation
Mining for frequent episodes has been an active research area in recent years. Numerous algorithms have been developed to discover different types of episodes, where most of them adopt an a priori-like approach that generates candidates and then recognises these candidates to determine their support. However, such methods are computationally expensive, depending on the size and structure of the...
متن کاملAn Efficient Xml Database Mining without Candidate Generation: an Frequent Pattern Split Approach
The popularity of XML results in producing large numbers of XML documents. Therefore, to develop an approach of association rule mining on native XML databases is an important research. The FP-growth based on an FP-tree algorithm performs more efficiently than other methods of association rules mining, but it cannot be applied to native XML databases. Hence, we adaptive an improving FPtree algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers in Biology and Medicine
سال: 2016
ISSN: 0010-4825
DOI: 10.1016/j.compbiomed.2015.12.016